Towards Logging Optimization for Dynamic Object Process Graph Construction
نویسندگان
چکیده
منابع مشابه
Towards Logging Optimization for Dynamic Object Process Graph Construction
Logging the execution process of a program is a popular activity for practical program understanding. However, understanding the behavior of a program from a complete execution trace is difficult because a system may generate a substantial number of runtime events. To focus on a small subset of runtime events, a dynamic object process graph (DOPG) has been proposed. Although a DOPG can potentia...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولTowards a Secure Logging Mechanism for Dynamic Systems
Logging is a central service in computing systems. It collects information about the events happening in (remote) devices and thereby provides a basis for other services within the system. However, in order to be useful, log data must be correct, for information derived from flawed sources is unreliable. In this paper, we report on ongoing work in developing a logging mechanism to securely stor...
متن کاملDynamic Graph Based Slicing for Object-oriented Programs
This paper proposes a Dynamic Graph (DG) traversal slicing algorithm for computing dynamic slices of object-oriented programs in presence of inheritance. The computed dynamic slice can facilitate various software engineering activities like program comprehension, testing, debugging, reverse engineering maintenance etc. This paper first proposes an intermediate program Dynamic Graph (DG) to repr...
متن کاملTowards Dynamic Graph Analysis: a Position Note
Tailored network analysis is at the core of some of the most successful Internet stories, as the Google search engine for instance [2]. Understanding complex networks is a challenge that receives a growing attention. Interestingly, this challenge is tackled not only by computer scientists, but also by biologists and physicists. Together, these efforts led to the definition of several important ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2013
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e96.d.2470